Recursive Elucidation of Polynomial Congruences Using Root-Finding Numerical Techniques
نویسندگان
چکیده
منابع مشابه
Recursive sequences and polynomial congruences
We consider the periodicity of recursive sequences defined by linear homogeneous recurrence relations of arbitrary order, when they are reduced modulo a positive integer m. We show that the period of such a sequence with characteristic polynomial f can be expressed in terms of the order of ω = x + f as a unit in the quotient ring ޚ m [ω] = ޚ m [x]/ f. When m = p is prime, this order can be ...
متن کاملCertiVed Numerical Root Finding
Root isolation of univariate polynomials is one of the fundamental problems in computational algebra. It aims to find disjoint regions on the real line or complex plane, each containing a single root of a given polynomial, such that the union of the regions comprises all roots. For root solving over the field of complex numbers, numerical methods are the de facto standard. They are known to be ...
متن کاملRounding LLL: Finding Faster Small Roots of Univariate Polynomial Congruences
In a seminal work at EUROCRYPT ’96, Coppersmith showed how to find all small roots of a univariate polynomial congruence in polynomial time: this has found many applications in public-key cryptanalysis and in a few security proofs. However, the running time of the algorithm is a high-degree polynomial, which limits experiments: the bottleneck is an LLL reduction of a high-dimensional matrix wit...
متن کاملBackward stability of polynomial root-finding using Fiedler companion matrices
Computing roots of scalar polynomials as the eigenvalues of Frobenius companion matrices using backward stable eigenvalue algorithms is a classical approach. The introduction of new families of companion matrices allows for the use of other matrices in the root-finding problem. In this paper, we analyze the backward stability of polynomial root-finding algorithms via Fiedler companion matrices....
متن کاملPolynomial Root-Finding Algorithms and Branched Covers
Introduction. The problem of devising optimal methods for numerically approximating the roots of a polynomial has been of interest for several centuries, and is far from solved. There are numerous recent works on root-finding algorithms and their cost, for example, the work of Jenkins and Traub [JT70], Renegar [Ren87], Schönhage [Sch82], and Shub and Smale [SS85, SS86, Sma85]. This list is far ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2014
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2014/575064